Features Determination from Super-Voxels Obtained with Relative Linear Interactive Clustering
نویسندگان
چکیده
منابع مشابه
Introducing a method for extracting features from facial images based on applying transformations to features obtained from convolutional neural networks
In pattern recognition, features are denoting some measurable characteristics of an observed phenomenon and feature extraction is the procedure of measuring these characteristics. A set of features can be expressed by a feature vector which is used as the input data of a system. An efficient feature extraction method can improve the performance of a machine learning system such as face recognit...
متن کاملInteractive Segmentation with Super-Labels
In interactive segmentation, the most common way to model object appearance is by GMM or histogram, while MRFs are used to encourage spatial coherence among the object labels. This makes the strong assumption that pixels within each object are i.i.d. when in fact most objects have multiple distinct appearances and exhibit strong spatial correlation among their pixels. At the very least, this ca...
متن کاملClustering with Interactive Feedback
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to a clustering algorithm in a natural way via split and merge requests. We then analyze the “clusterability” of different concept classes in this framework — the ability to cluster correctly with a bounded number of re...
متن کاملDiscriminative Clustering with Relative Constraints
We study the problem of clustering with relative constraints, where each constraint specifies relative similarities among instances. In particular, each constraint (xi, xj , xk) is acquired by posing a query: is instance xi more similar to xj than to xk? We consider the scenario where answers to such queries are based on an underlying (but unknown) class concept, which we aim to discover via cl...
متن کاملInteractive Clustering of Linear Classes and Cryptographic Lower Bounds
We study an interactive model of supervised clustering introduced by Balcan and Blum [7], where the clustering algorithm has query access to a teacher. We give an efficient algorithm clustering linear functionals over finite fields, which implies the learnability of parity functions in this model. We also present an efficient clustering algorithm for hyperplanes which are a natural generalizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image Processing & Communications
سال: 2016
ISSN: 2300-8709
DOI: 10.1515/ipc-2016-0017